tree walking automaton造句

例句与造句

1. A simple example of a tree walking automaton is a TWA that performs depth-first search ( DFS ) on the input tree.
2. Informally, a tree walking automaton " A " ( TWA ) is a finite state device which walks over the tree in a sequential manner.
3. A pebble automaton is a tree walking automaton with an additional finite set of fixed size containing pebbles, identified with \ { 1, 2, \ dots, n \ }.
4. It's difficult to find tree walking automaton in a sentence. 用tree walking automaton造句挺难的